Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85]
نویسندگان
چکیده
The proof of Theorem 6 in the paper by J. He and X. Yao [Artificial Intelligence 127 (1) (2001) 57–85] contains a mistake, although the theorem is correct [S. Droste et al., Theoret. Comput. Sci. 276 (2002) 51–81]. This note gives a revised proof and theorem. It turns out that the revised theorem is more general than the original one given an evolutionary algorithm with mutation probability pm = 1/(2n), using the same proof method as given by J. He and X. Yao [Artificial Intelligence 127 (1) (2001) 57–85]. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Multi-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms
Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...
متن کاملDrift analysis and average time complexity of evolutionary algorithms
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including conditions under which an EA will take no more than polynomial time (in problem size) to solve a prob...
متن کاملAppraisal of the evolutionary-based methodologies in generation of artificial earthquake time histories
Through the last three decades different seismological and engineering approaches for the generation of artificial earthquakes have been proposed. Selection of an appropriate method for the generation of applicable artificial earthquake accelerograms (AEAs) has been a challenging subject in the time history analysis of the structures in the case of the absence of sufficient recorded accelerogra...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Drift analysis is a powerful tool used to bound the optimization time of evolutionary algorithms (EAs). Various previous works apply a drift theorem going back to Hajek in order to show exponential lower bounds on the optimization time of EAs. However, this drift theorem is tedious to read and to apply since it requires two bounds on the moment-generating (exponential) function of the drift. A ...
متن کاملUse of the Improved Frog-Leaping Algorithm in Data Clustering
Clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. K-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. In recent years, several algorithms are provided based on evolutionary algorithms for cluster...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 140 شماره
صفحات -
تاریخ انتشار 2002